Greedy Sensor Placement With Cost Constraints
نویسندگان
چکیده
منابع مشابه
Semi-greedy heuristics for feature selection with test cost constraints
In real-world applications, the test cost of data collection should not exceed a given budget. The problem of selecting an informative feature subset under this budget is referred to as feature selection with test cost constraints. Greedy heuristics are a natural and efficient method for this kind of combinatorial optimization problem. However, the recursive selection of locally optimal choices...
متن کاملMinimizing Uncertainty through Sensor Placement with Angle Constraints
We study the problem of sensor placement in environments in which localization is a necessity, such as ad-hoc wireless sensor networks that allow the placement of a few anchors that know their location or sensor arrays that are tracking a target. In most of these situations, the quality of localization depends on the relative angle between the target and the pair of sensors observing it. In thi...
متن کاملStochastic Greedy Methods with Sparse Constraints
Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for optimization problems with sparsity constraints. We prove linear convergence in expectation to the solution within a specified tolerance. This framework applies to problems such as sparse signal recovery in compressed sensing and lowrank matrix recovery, giving methods wi...
متن کاملSensor Placement for Fault Diagnosis Performance Maximization under Budgetary Constraints
This paper presents a strategy based on fault diagnosability maximization to optimally locate sensors in complex systems. The goal is to characterize and determine a sensor configuration that guarantees a maximum degree of diagnosability and does not exceed a maximum sensor configuration cost. The strategy is based on the structural system model. Structural analysis is a powerful tool for deali...
متن کاملQuick Placement with Geometric Constraints
In this paper an original constraint-driven placement tool targeted for full-custom mixed-signal design is described. One of its main objectives is to quickly obtain feasible layout con gurations, and explore e ciently the e ect of di erent sets of constraints in an interactive environment. By using direct-approach algorithms, all feasible constraints are met by construction. Overconstraints ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Sensors Journal
سال: 2019
ISSN: 1530-437X,1558-1748,2379-9153
DOI: 10.1109/jsen.2018.2887044